When does a planar bipartite framework admit a continuous deformation?
نویسندگان
چکیده
Let K(X; Y ) denote the bipartite framework in the plane that realizes the complete bipartite graph Km;n with partite sets X; Y ; |X | = m; |Y | = n. We show that for m¿3; n¿5, K(X; Y ) admits a continuous deformation if and only if X lies on a line ‘ and Y lies on a line perpendicular to ‘. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
When does the complement of the annihilating-ideal graph of a commutative ring admit a cut vertex?
The rings considered in this article are commutative with identity which admit at least two nonzero annihilating ideals. Let $R$ be a ring. Let $mathbb{A}(R)$ denote the set of all annihilating ideals of $R$ and let $mathbb{A}(R)^{*} = mathbb{A}(R)backslash {(0)}$. The annihilating-ideal graph of $R$, denoted by $mathbb{AG}(R)$ is an undirected simple graph whose vertex set is $mathbb{A}(R...
متن کاملA note on the hardness results for the labeled perfect matching problems in bipartite graphs
In this note, we strengthen the inapproximation bound of O(log n) for the labeled perfect matching problem established in J. Monnot, The Labeled perfect matching in bipartite graphs, Information Processing Letters 96 (2005) 81-88, using a self improving operation in some hard instances. It is interesting to note that this self improving operation does not work for all instances. Moreover, based...
متن کاملOptimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms
This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...
متن کاملHabilitationà Diriger Des Recherches Combinatoire Des Cartes Planaires Par Méta-bijection Combinatoire Des Cartes Planaires Par Méta-bijection
In this document we present a general bijective framework for planar maps (connected graphs embedded on the sphere up to continuous deformation). Our method relies on a so-called ‘master bijection’ between certain oriented (planar) maps and certain tree-structures called (blossoming) mobiles; several families of maps can be shown to be characterized by certain ‘canonical’ orientations, making t...
متن کاملBipartite minors
We introduce a notion of bipartite minors and prove a bipartite analog of Wagner’s theorem: a bipartite graph is planar if and only if it does not contain K3,3 as a bipartite minor. Similarly, we provide a forbidden minor characterization for outerplanar graphs and forests. We then establish a recursive characterization of bipartite (2, 2)-Laman graphs — a certain family of graphs that contains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 263 شماره
صفحات -
تاریخ انتشار 2001